On the Furtwangler algorithm for simultaneous rational approximation
نویسنده
چکیده
منابع مشابه
A method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملSignal detection Using Rational Function Curve Fitting
In this manuscript, we proposed a new scheme in communication signal detection which is respect to the curve shape of received signal and based on the extraction of curve fitting (CF) features. This feature extraction technique is proposed for signal data classification in receiver. The proposed scheme is based on curve fitting and approximation of rational fraction coefficients. For each symbo...
متن کاملFuzzy Best Simultaneous Approximation of a Finite Numbers of Functions
Fuzzy best simultaneous approximation of a finite number of functions is considered. For this purpose, a fuzzy norm on $Cleft (X, Y right )$ and its fuzzy dual space and also the set of subgradients of a fuzzy norm are introduced. Necessary case of a proved theorem about characterization of simultaneous approximation will be extended to the fuzzy case.
متن کاملThree Different Methods for Approximate Analysis of Bar Structures
In this paper, modified solutions were compared through utilizing three different approximate methods for bar structures. The modifications considered various changes in the initial design. To authors' best of knowledge, the studies have carried out on this matter so far are not broad enough and have considerred the simeltaneous variations of size, geometry and topology on the bar structures. I...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کامل